Strong Dominating Sets of Some Arithmetic Graphs
نویسندگان
چکیده
منابع مشابه
Some Dominating Sets of Lexicographic Product Graphs of Euler Totient Cayley Graphs with Arithmetic Graphs
The theory of domination in graphs is an emerging area of research in graph theory today. It has been studied extensively and finds applications to various branches of Science & Technology.Products are often viewed as a convenient language with which one can describe structures, but they are increasingly being applied in more substantial ways. In this paper, we consider lexicographic product gr...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملOn unique minimum dominating sets in some Cartesian product graphs
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
متن کاملDominating sets in directed graphs
We consider the problem of incrementally computing a minimal dominating set of a directed graph after the insertion or deletion of a set of arcs. Earlier results have either focused on the study of the properties that minimum (not minimal) dominating sets preserved or lacked to investigate which update affects a minimal dominating set and in what ways. In this paper, we first show how to increm...
متن کاملDominating Sets in Planar Graphs
Motivated by an application to unstructured multigrid calculations, we consider the problem of asymptotically minimizing the size of dominating sets in triangulated planar graphs. Speci cally, we wish to nd the smallest such that, for n su ciently large, every n-vertex planar graph contains a dominating set of size at most n. We prove that 1 4 13 , and we conjecture that = 14 . For triangulated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/14431-2577